Time complexity

Results: 894



#Item
31Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗  Christoph Lenzen

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:31
32Modular composition modulo triangular sets and applications ´ Adrien Poteaux† ? Eric Schost†

Modular composition modulo triangular sets and applications ´ Adrien Poteaux† ? Eric Schost†

Add to Reading List

Source URL: www.csd.uwo.ca

Language: English - Date: 2011-11-11 00:13:36
33OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su

OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2007-10-09 08:45:20
34Classical and Quantum Algorithms for Finding Cycles Jill Cirasella Computational Sciences Specialist Brooklyn College Library

Classical and Quantum Algorithms for Finding Cycles Jill Cirasella Computational Sciences Specialist Brooklyn College Library

Add to Reading List

Source URL: jillcirasella.commons.gc.cuny.edu

Language: English - Date: 2014-05-02 15:14:51
35Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡  Shaddin Dughmi§

Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡ Shaddin Dughmi§

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2011-05-11 07:37:06
36CS364B: Frontiers in Mechanism Design Lecture #8: MIR and MIDR Mechanisms∗ Tim Roughgarden† January 29,

CS364B: Frontiers in Mechanism Design Lecture #8: MIR and MIDR Mechanisms∗ Tim Roughgarden† January 29,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-02-19 21:14:11
37Approximating the Size of a Radio Network in Beeping Model Philipp Brandes1 , Marcin Kardas2 , Marek Klonowski2 , Dominik Pająk2 , and Roger Wattenhofer1 ? 1  2

Approximating the Size of a Radio Network in Beeping Model Philipp Brandes1 , Marcin Kardas2 , Marek Klonowski2 , Dominik Pająk2 , and Roger Wattenhofer1 ? 1 2

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-07-19 07:32:17
38Wetland Wonders Grades: K - 3 Time: 45 minutes Rationale and Context: Living and non-living things contribute to the complexity and dynamic systems of a wetland habitat. Students will consider the value of a wetland habi

Wetland Wonders Grades: K - 3 Time: 45 minutes Rationale and Context: Living and non-living things contribute to the complexity and dynamic systems of a wetland habitat. Students will consider the value of a wetland habi

Add to Reading List

Source URL: www.echovermont.org

Language: English - Date: 2012-09-03 16:34:53
39Wetland Wonders Grades: K - 3 Time: 45 minutes Rationale and Context: Living and non-living things contribute to the complexity and dynamic systems of a wetland habitat. Students will consider the value of a wetland habi

Wetland Wonders Grades: K - 3 Time: 45 minutes Rationale and Context: Living and non-living things contribute to the complexity and dynamic systems of a wetland habitat. Students will consider the value of a wetland habi

Add to Reading List

Source URL: www.echovt.org

Language: English - Date: 2012-09-03 16:34:53
40The Partition Technique for Overlays of Envelopes∗ Vladlen Koltun† Micha Sharir‡  Abstract

The Partition Technique for Overlays of Envelopes∗ Vladlen Koltun† Micha Sharir‡ Abstract

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2009-04-29 21:59:48